Domain Theory Meets Default
نویسندگان
چکیده
1 Abstract. We present a development of the theory of default information structures, combining ideas from domain theory with ideas from non-monotonic logic. Conceptually, our treatment is distinguished from standard default logic in that we view default structures as generating models rather than theories. Reiter's default rules are viewed as non-deterministic algorithms for generating preferred partial models. Using domain-theoretical notions, we improve the standard deenition of extensions in default logic, by introducing the notion of dilation. We prove the existence of such dilations for a new, natural class of default information structures, properly including the so-called semi-normal ones. This class, called the class of rational structures, is a robust generalization of the usual kind of default rule system.
منابع مشابه
Domain Theory Meets Default Logic 1
We present a development of the theory of default information structures, combining ideas from domain theory with ideas from non-monotonic logic. Conceptually, our treatment is distinguished from standard default logic in that we view default structures as generating models rather than theories. Reiter's default rules are viewed as non-deterministic algorithms for generating preferred partial m...
متن کاملSuggestions for a Non-monotonic Feature Logic
We use Scott's domain theory and methods from Reiter's default logic to suggest some ways of modelling default constraints in feature logic. We show how default feature rules, derived from default constraints, can be used to give ways to augment strict feature structures with default information.
متن کاملFred meets Tweety
We propose a framework that brings together two major forms of default reasoning in Artificial Intelligence: applying default property classification rules in static domains, and default persistence of properties in temporal domains. Particular attention is paid to the problem of qualification, central in default reasoning and in any attempt to integrate different forms of this type of reasonin...
متن کاملConstraints in Nonmonotonic Reasoning
We report on the use of constraints to govern partial models of rst-order logic. These models are constructed using systems of default rules, as in the default logic of Reiter, but where Reiter's rules build logical theories, our rules build models. Our approach takes advantage of domain-theoretic notions. A system of default rules is a straightforward generalization of Scott's notion of inform...
متن کاملDefaults in Domain Theory Defaults in Domain Theory
This paper uses ideas from artiicial intelligence to show how default notions can be deened over Scott domains. We combine these ideas with ideas arising in domain theory to shed some light on the properties of nonmonotonicity in a general model-theoretic setting. We consider in particular a notion of default nonmonotonic entailment between prime open sets in the Scott topology of a domain. We ...
متن کامل